Direct Contouring of Implicit Closest Point Surfaces
نویسندگان
چکیده
Constructing a (signed) distance field and contouring its zero level set are two important steps in many surface reconstruction methods. While most high-quality distance transforms compute the distance to the surface as well as the closest point on it, the contouring step typically uses only the distance and omits the closest point information. Our novel closest point contouring algorithm (CPC) uses the full closest point field, and, thus, allows improving existing methods for high-quality triangle mesh reconstruction based on implicit function models: Since we select the vertex positions directly from the set of closest points, all triangle vertices are guaranteed to lie exactly on the zero-contour and no approximations are necessary. By employing recent findings in the context of so-called embedding techniques, we derive a formulation of the mean curvature vector on the closest point representation and use this formulation to properly select the vertices to be triangulated. In combination with a new table-based triangulation scheme this allows us to detect and preserve sharp features, and to avoid small degenerated triangles in smooth areas. CPC can handle open and non-orientable surfaces, and its data-parallel nature makes it well suited for GPUs.
منابع مشابه
Defining, contouring, and visualizing scalar functions on point-sampled surfaces
This paper addresses the definition, contouring, and visualization of scalar functions on unorganized point sets, which are sampled from a surface in 3D space; the proposed framework builds on moving least-squares techniques and implicit modeling. Given a scalar function f : P → R, defined on a point set P , the idea behind our approach is to exploit the local connectivity structure of the k-ne...
متن کاملThe Implicit Closest Point Method for the Numerical Solution of Partial Differential Equations on Surfaces
In this presentation, we describe an implicit Closest Point Method [3] which allows large, stable time steps for high-order PDEs while retaining the principal benefits of the original method. Example computations (including the in-surface heat equation, reaction-diffusion on surfaces, Laplace–Beltrami eigenmodes, and fourth-order interface motion) on a variety of surfaces demonstrate the effect...
متن کاملFrom Explicit to Implicit Surfaces for Visualization, Animation and Modeling
Deformable 3–D models are used extensively in Computer Graphics and Computer Vision for Visualization, Animation and Modeling. They can be represented either as traditional explicit surfaces, such as triangulated meshes, or as implicit surfaces. On one hand, explicit surfaces can easily be manually deformed by users, such as graphics designers, either directly by moving the mesh vertices or ind...
متن کاملImplicit Meshes for Modeling and Reconstruction
Explicit surfaces, such as triangulations or wireframe models, have been extensively used to represent the deformable 3–D models that are used to fit 3–D point and 2–D silhouette data. The resulting approaches, however, suffer from the fact that fitting typically involves finding the facets that are closest to the 3–D data points or most likely to be silhouette facets. This requires searching, ...
متن کاملDirect NC path generation: from discrete points to continuous spline paths
Spline paths in NC machining are advantageous over linear and circular paths due to their smoothness and compact representation, thus are highly desirable in high-speed machining where frequent change of tool position and orientation may lead to inefficient machining, tool wear and chatter. This paper presents an approach for calculating spline NC paths directly from discrete points with contro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013